P2p Semantic Search P2p Semantic Search

نویسنده

  • Uladzimir Kharkevich
چکیده

We consider P2P Semantic Search as a process of finding documents, which are semantically, i.e., with respect to the meaning, related to the user information needs, in a document collections distributed among a group of peers, i.e., autonomous information sources. To organize documents stored on a single peer efficiently for the search, documents are classified to the user-generated classifications. Nodes in the classification specify concepts which the user is interested in. Accordingly, the whole classification specifies the user interest profile. To provide effective search in the P2P network, peers in the network should have some ways for cooperation. In our approach, related nodes in classifications on different peers are interconnected by means of semantic links, which allow peers in the network to reason about the contents of each other and efficiently cooperate. The main foci of the current PhD thesis are the development of an algorithm for P2P Semantic Search in a distributed system of interconnected classifications; the development of a P2P Semantic search system implementing the algorithm; and the development of a testing methodology allowing for a comprehensive evaluation of the system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P2P Concept Search: Some Preliminary Results∗

Concept Search extends syntactic search, i.e., search based on the computation of string similarity between words, with semantic search, i.e., search based on the computation of semantic relations between complex concepts. It allows us to deal with ambiguity of natural language. P2P Concept Search extends Concept Search by allowing distributed semantic search over structured P2P network. The ke...

متن کامل

Domain Specific Distributed Search Engine Based on Semantic P2P Networks

This paper presents a distributed search engine based on semantic P2P Networks. The user’s computers join the domains in which user wants to share information in semantic P2P networks which is domain specific virtual tree (VIRGO ). Each user computer contains search engine which indexes the domain specific information on local computer or Internet. We can get all search information through P2P ...

متن کامل

A Small World Overlay Network for Semantic Based Search in P2P Systems

For a peer-to-peer (P2P) system holding massive amount of data, efficient search for resources (such as data or services) is a key determinant to its scalability. This paper presents semantic small world (SSW), an overlay network and index structure for semantic based P2P search. By dynamically clustering peer nodes in a semantic space based on the semantics of their data and organizing the clu...

متن کامل

Design and Implementation of a Semantic Peer-to-Peer Network

Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems due to scalability, fault-tolerance, and self-organizing nature. This decentralized architecture, however, makes it difficult for traditional P2P networks to globally share useful semantic knowledge among nodes. As a result, traditional P2P networks...

متن کامل

An Efficient Semantic Search Scheme for Decentralized P2P Environment

Peer-to-peer (P2P) is becoming prevalent on the Internet. However, due to the nature of exact hash matching, the DHT-based P2P itself doesn’t support decentralized semantic search. In this letter, we propose a Decentralized Unicode Suffix Tree Overlay (DUSTO), which can support multiple languages and keywords search. The simulation results indicate the average search length of DUSTO method is 7...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007